Congestion aware layer promotion

ABSTRACT

Embodiments relate to managing layer promotion of interconnects in the routing phase of integrated circuit design. An aspect includes reducing the set of candidate interconnects for layer promotion based on resource availability. A method of managing includes identifying a set of candidate interconnects for the layer promotion, scoring and sorting the set of candidate interconnects according to a respective score, thereby establishing a respective rank, and assessing routing demand and resource availability based on promoting the set of candidate interconnects. The method also includes managing the set of candidate interconnects based on the respective rank and the assessing, the assessing and the managing being done iteratively and the managing including, in at least one iteration, generating a second set of candidate interconnects based on reducing the set of candidate interconnects.

BACKGROUND

The present invention relates generally to the routing phase ofintegrated circuit design, and more specifically, to congestion awarelayer promotion.

Typically, integrated circuit (chip) design includes synthesis,placement, and routing stages that may be performed iteratively todevelop the final design for fabrication of the integrated circuit. Thedesign may be organized into equal-sized grids that each include anumber of components such as transistors. The routing stage placesinterconnects between transistors within and among the various grids.These interconnects are placed in layers with the lowest (and generallyslowest) layer being closest to the device and the highest (andgenerally fastest) layer being closest to the packaging of the chip.

One of the important design considerations is timing constraints. Thatis, the signals carried by the various interconnects must reach theirintended destinations within specified timing requirements for theintegrated circuit to function properly. The iterative process isundertaken in integrated circuit design in large part to ensure that thetiming constraints are adhered to. During that process, one of thetechniques that may be used to improve the timing of some interconnectsis layer promotion. Layer promotion refers to moving or “promoting” aninterconnect to a higher (and faster) level to improve timing.

SUMMARY

According to one embodiment, a computer program product for implementingmanagement of layer promotion in a routing phase of integrated circuitdesign includes a computer readable storage medium having programinstructions embodied therewith. The program instructions are readableby a processor to cause the processor to perform a method includingidentifying a set of candidate interconnects for the layer promotion;scoring and sorting the set of candidate interconnects according to arespective score, thereby establishing a respective rank; assessingrouting demand and resource availability based on promoting the set ofcandidate interconnects; and managing, using a processor, the set ofcandidate interconnects based on the respective rank and the assessing,the assessing and the managing being done iteratively and the managingincluding, in at least one iteration, generating a second set ofcandidate interconnects based on reducing the set of candidateinterconnects.

According to another embodiment, a method of managing layer promotion ina routing phase of integrated circuit design includes identifying a setof candidate interconnects for the layer promotion; scoring and sorting,using a processor, the set of candidate interconnects according to arespective score, thereby establishing a respective rank; assessingrouting demand and resource availability based on promoting the set ofcandidate interconnects; and managing, using the processor, the set ofcandidate interconnects based on the respective rank and the assessing,the assessing and the managing being done iteratively and the managingincluding, in at least one iteration, generating a second set ofcandidate interconnects based on reducing the set of candidateinterconnects.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The subject matter which is regarded as embodiments is particularlypointed out and distinctly claimed in the claims at the conclusion ofthe specification. The forgoing and other features, and advantages ofthe embodiments are apparent from the following detailed descriptiontaken in conjunction with the accompanying drawings in which:

FIG. 1 is a block diagram of a system to synthesize a design for anintegrated circuit according to an embodiment of the invention;

FIG. 2 is an exemplary design block of a physical implementation of theintegrated circuit;

FIG. 3 is a process flow of a method of managing layer promotionaccording to embodiments of the invention; and

FIG. 4 illustrates placement effect on timing.

DETAILED DESCRIPTION

Embodiments described herein relate to congestion aware layer promotion.Specifically, the degree of deficiency in meeting timing requirementsand the degree to which decisions in the placement stage affect timingare considered in determining which interconnects to promote to a higherlayer.

As noted above, layer promotion increases the speed of the promotedinterconnects. However, other considerations may prevent the applicationof layer promotion to every interconnect whose timing may suggest thatlayer promotion is needed. One of these considerations is congestion.Thus, if every interconnect seemingly requiring layer promotion is movedto a higher layer, that higher layer may become congested to thedetriment of timing and other parameters in that layer. As a result,layer promotion may be regarded as a limited resource.

Current routing and layer promotion methodologies may promoteinterconnects based on the amount of timing improvement expected basedon the layer promotion. This approach fails to address issues such as,for example, those in the placement stage that may be responsible forthe timing. That is, in the case of some interconnects, modifyingplacement in a subsequent iteration of the placement stage may partly orentirely mitigate the timing deficiency. These interconnects may then beremoved from the set of candidate interconnects that indicate a need forlayer promotion. On the other hand, as the design of the integratedcircuit progresses and there is less flexibility for placement changesin consideration of all the other design objectives, more of theinterconnects that may benefit from timing improvement based onplacement changes may instead rely on layer promotion. Embodimentsdetailed below facilitate consideration of not only the need for layerpromotion, with regard to timing, but also the possibility that layerpromotion may be avoided by instead mitigating placement-based timingissues.

FIG. 1 is a block diagram of a system to synthesize a design for anintegrated circuit according to an embodiment of the invention. Aprocessing system 110 (e.g., computer or computer system) may implementthe synthesis engine (to perform the synthesis, placement, and routingstages) in one or more processors 116. An input interface 112 (e.g.,keyboard, mouse) may be used to develop the logic design (from aregister transfer level or RTL description of the design) which isstored in one or more memory devices 114 of the processing system 110.An output interface 118 (e.g., display, output port) may be used todisplay a netlist resulting from the synthesis or provide theinformation to place and route components of the physical implementation120 (e.g., chip). The physical implementation 120 includes creatingcomponents (e.g., transistors, resistors, capacitors) andinterconnections (interconnect 310, FIG. 3) there between on asemiconductor (e.g., silicon wafer). The embodiments described below maybe implemented by the processor 116 executing instructions stored in thememory device 114.

FIG. 2 is an exemplary design block 230 of a physical implementation 120of the integrated circuit. The design block 230 is organized into tilesor grids 220 that each includes multiple components. Interconnects 210are routed among the components to carry signals within or among grids220. The example shown in FIG. 2 is of interconnects 210 from componenta (signal source) to component f (signal sink) that go throughcomponents b, c, d, and e. The Steiner placement length indicated by thedashed line represents the shortest possible connection between thesource and sink. That is, if the components b, c, d, and e were placed(in the placement stage) along the dashed line instead of as shown inFIG. 2, then the sum of the lengths of the interconnects 210 betweencomponent a (source) and component f (sink) would be as small aspossible. Thus, as noted above, the ability to modify placement maymitigate the deficiencies of some interconnects 210 in meeting timingrequirements. Placement is a consideration in deciding whichinterconnects 210 to move (through layer promotion) according toembodiments discussed further below.

FIG. 3 is a process flow of a method of managing layer promotionaccording to embodiments of the invention. It should be noted that theprocesses shown in FIG. 3 are in the routing phase of design whichitself is iterative with the synthesis and placement phases to developthe final design for fabrication of the physical implementation 120 orchip. At block 310, identifying a set of candidate interconnects 210includes identifying interconnects 210 that meet a specified slackimprovement threshold. The slack improvement threshold is a minimumamount of timing improvement that must result from layer promotion (at aminimum) for a given interconnect 210 in order for that interconnect 210to be considered a candidate for layer promotion. By using the slackimprovement threshold to select the candidate interconnects 210,interconnects 210 that are not expected to exhibit a (sufficient) timingimprovement as a result of layer promotion are prevented from using upthe limited resource that layer promotion represents. At block 320,scoring and sorting the candidate interconnects 210 is further detailedbelow. The scoring involves two factors, a timing improvement factor anda placement factor, and the two factors are weighted differently basedon the development stage of design in which the routing phase is beingperformed. The sorting is according to the score such that a rankingbased on the score is established for the candidate interconnects 210.

At block 330, assessing the routing demand and resource availabilitybased on the initial (current) layer promotion candidate list is done ona per grid 220 basis. This process involves determining the congestionand other effects resulting from promoting every interconnect 210 amongthe candidate interconnects 210 for layer promotion. This analysis doesnot involve actually moving or upgrading any of the routing but providesinformation about demand and availability trade-off through what can bethought of as a hypothetical promotion of all the candidateinterconnects 210. To be clear, in view of the fact that the routingphase is still part of the design stage and not the physicalfabrication, “actually moving” interconnects 210 or promotinginterconnects 210 as opposed to hypothetically promoting interconnects210 for analysis still refers to moving interconnects in an iteration ofthe design. The assessment at block 330 indicates whether all thecandidate interconnects 210 may, in fact, be promoted to a higher layeror if some number of interconnects 210 fewer than all the candidateinterconnects 210 may be promoted instead. This assessment is on aper-grid 220 basis, because congestion and resource availability arebest addressed in a localized context rather than over a full path fromsource to sink traversing multiple grids 220. At block 340, the processincludes managing layer promotion of the candidate interconnects 210based on the sorting (done at block 320) and resource availability(determined at block 330). The managing at block 340 involves pruninginterconnects 210 from the candidate interconnects 210 for layerpromotion when the process at block 330 indicates that there areinsufficient resources to facilitate layer promotion for all candidateinterconnects 210. The pruning is according to the ranking establishedby the process at block 320. As indicated in FIG. 3, the processes atblocks 330 and 340 are performed iteratively. Thus, after a pruned(smaller) set of candidate interconnects 210 is generated at block 340,the assessment is performed again at block 330 to determine if thepruned set of candidate interconnects 210 may all be promoted or ifadditional (or less) pruning is required by performing the process atblock 340 again. Less pruning (the recovery of some of the previouslydiscarded candidate interconnects 210) may be warranted based on anassessment that resources are left over after accommodating the prunedset of candidate interconnects 210. The scoring and sorting to rank thecandidate interconnects is further detailed below.

The score given to a given candidate interconnect 210 is as follows:score=scaling_(t) *t_metric+scaling_(p) *p_metric  [EQ. 1]The t_metric refers to a metric reflecting the timing deficiencyassociated with the candidate interconnect 210. The timing deficiency isthe amount of time by which the candidate interconnect 210 fails itstiming requirement (failure_amount). The t_metric is given by:

$\begin{matrix}\frac{failure\_ amount}{{highest\_ failure}{\_ amount}} & \left\lbrack {{EQ}.\mspace{14mu} 2} \right\rbrack\end{matrix}$The highest_failure_amount refers to the largest failure_amount amongcandidate interconnects 210 within the grid 220 of the candidateinterconnect 210. As EQ. 2 indicates, when the candidate interconnect210 failure_amount is the highest_failure_amount in the grid 220, thenthe result of EQ. 2 would be equal to 1. That is, t_metric for thecandidate interconnect 210 that has the failure_amount that is thehighest_failure_amount in the grid 220 is 1. The result of EQ. 2 forevery other candidate interconnect 210 in that grid 220 would be somenumber less than 1. The p_metric refers to a metric reflecting theplacement issues that affect timing of a candidate interconnect 210.Like t_metric, p_metric is based on a per-grid perspective. The value ofp_metric is given by:

$\begin{matrix}\frac{placement\_ ratio}{{maximum\_ placement}{\_ ratio}} & \left\lbrack {{EQ}.\mspace{14mu} 3} \right\rbrack\end{matrix}$The placement_ratio is explained with reference to FIG. 4.

FIG. 4 illustrates placement effect on timing. The interconnects 210 a,210 b, 210 c between component w and component z depict a path (orsubset of a path centered around the interconnect 210 for which p_metricis being computed) within a given grid 220 and are shown under twodifferent scenarios A and B. In scenario A, because of the placement ofcomponents x and y, the length of interconnect 210 b is longer than inscenario B. Thus, a modification in placement from the one shown asscenario A to the one shown as scenario B would lead to a decrease inthe length of interconnect 210 b and, consequently, an improvement inthe timing required for the interconnect 210 b. The effect of placementon the timing is expressed through the placement_ratio given by:

$\begin{matrix}\frac{\sum\left( {{length}\left( {{210a},{210b},{210c}} \right)} \right)}{{Steiner\_ placement}{\_ length}} & \left\lbrack {{EQ}.\mspace{14mu} 4} \right\rbrack\end{matrix}$As FIG. 4 illustrates, the sum of the path or the sum of the lengths ofthe interconnects 210 a, 210 b, 210 c is longer in scenario A than inscenario B. The Steiner_placement_length is the shortest length betweencomponents w and z. If components x and y were placed (during theplacement phase) along the dotted line indicating the Steiner placementlength in FIG. 4, then placement_ratio would have a value of 1. When thecomponents do not line up along the dotted line marked as the Steinerplacement length (as in both scenarios A and B), then theplacement_ratio is greater than 1. The more the path strays from theSteiner placement length dashed line shown in FIG. 4, the greater thevalue of placement_ratio. The maximum_placement_ratio is the largestplacement_ratio within a grid 220 among the paths including candidateinterconnects 210. As EQ. 3 indicates, when the placement_ratio is themaximum_placement_ratio (for a given path in a grid 220), thecorresponding p_metric is 1. When the placement_ratio is not themaximum_placement_ratio (and is, therefore, necessarily a value smallerthan the maximum_placement_ratio), then the corresponding p_metric isless than 1. Thus, like t_metric, p_metric is a value of 1 or less. Asdetailed above, by using the highest_failure_amount andmaximum_placement_ratio in the calculation of t_metric and p_metric,respectively, t_metric and p_metric are normalized values.

As EQ. 1 indicates, t_metric is associated with scaling factorscaling_(t), and p_metric is associated with scaling factor scaling_(p).The scaling factors are given by:scaling_(t)+scaling_(p)=1  [EQ. 5]The scaling factors are used to weight t_metric and p_metricindependently. The scaling factors may be changed as the integratedcircuit design moves from the early stages to later stages close tofinalization of the design. This is because the scaling factors affectthe score of a given candidate interconnect 210, and the influence ofthe possibility of improving timing through placement modifications maydiminish over the design life. That is, for example, early in the designprocess, the placement of components may be more fluid and scaling_(p)may be smaller than scaling_(t) to reflect that the score should not behigh for a candidate interconnect 210 that is affected by placementissues and may, therefore, benefit from placement modification ratherthan layer promotion. In that early period, the t_metric would beweighted more heavily. Later in the design process, the placement ofcomponents may be relatively more fixed based on meeting all the otherrequirements of the design. In this case, the value of scaling_(p)relative to scaling_(t) may be increased (e.g., to be equal toscaling_(t)) in recognition of the fact that timing deficiencies ofcandidate interconnects 210 resulting from poor placement may no longerbe addressable through placement changes and may warrant layer promotioninstead. While the specific embodiments for defining and calculatingt_metric, p_metric, and the scaling factors may be changed, theunderlying considerations are to limit the number of interconnects 210that are promoted based on congestion and to limit according to aranking among the candidate interconnects 210 identified for layerpromotion.

Technical effects and benefits include congestion aware layer promotionthat manages candidate interconnects 210 according to their relativeneed and expected benefit from layer promotion.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Asused herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, element components,and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present invention has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the invention in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the invention. Theembodiment was chosen and described in order to best explain theprinciples of the invention and the practical application, and to enableothers of ordinary skill in the art to understand the invention forvarious embodiments with various modifications as are suited to theparticular use contemplated.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

What is claimed is:
 1. A computer program product for implementingmanagement of layer promotion in a routing phase of integrated circuitdesign, the computer program product comprising: a computer readablestorage medium having program instructions embodied therewith, theprogram instructions readable by a processor to cause the processor toperform a method comprising: identifying a set of candidateinterconnects for the layer promotion; scoring and sorting the set ofcandidate interconnects according to a respective score, therebyestablishing a respective rank; assessing routing demand and resourceavailability based on promoting the set of candidate interconnects; andmanaging, using a processor, the set of candidate interconnects based onthe respective rank and the assessing, the assessing and the managingbeing done iteratively and the managing including, in at least oneiteration, generating a second set of candidate interconnects based onreducing the set of candidate interconnects, wherein the scoring the setof candidate interconnects includes determining, for each candidateinterconnect of the set of candidate interconnects, an amount of time bywhich the candidate interconnect exceeds a timing requirement and adegree to which a length of a path including the candidate interconnectexceeds a minimum possible length of the path, and the scoring the setof candidate interconnects includes calculating, for the respectivecandidate interconnect, a score given by:score=scaling_(t) *t_metric+scaling_(p) *p_metric, where scaling_(t) andscaling_(p) are scaling factors, t_metric relates to the amount of timeby which the candidate interconnect exceeds the timing requirement, andp_metric relates to the degree to which the length of the path includingthe candidate interconnect exceeds the minimum possible length of thepath.
 2. The computer program product according to claim 1, wherein theassessing includes determining congestion in a higher layer based onhypothetical promotion of the set of candidate interconnects to thehigher layer, the higher layer being further from devices than a currentlayer of the set of candidate interconnects.
 3. The computer programproduct according to claim 2, wherein the assessing further includesdetermining a number of the set of candidate interconnects that may formthe second set of candidate interconnects based on the congestion. 4.The computer program product according to claim 1, wherein the scoringand sorting the set of candidate interconnects, the assessing, and themanaging is done on a per-grid basis.
 5. The computer program productaccording to claim 1, wherein t_metric is given by:$\frac{failure\_ amount}{{highest\_ failure}{\_ amount}},$ wherefailure_amount is the amount of time by which the candidate interconnectexceeds the timing requirement, and highest_failure_amount is a highestamount of time by which any candidate interconnect of the set ofcandidate interconnects in a same grid as the candidate interconnectexceeds a respective timing requirement.
 6. The computer program productaccording to claim 1, wherein the p_metric is given by:$\frac{placement\_ ratio}{{maximum\_ placement}{\_ ratio}},$ whereplacement_ratio indicates the degree to which the length of the pathincluding the candidate interconnect exceeds the minimum possible lengthof the path, and maximum_placement_ratio indicates a largestplacement_ratio determined for any candidate interconnect of the set ofcandidate interconnects in a same grid as the candidate interconnect. 7.A method of managing layer promotion in a routing phase of integratedcircuit design, the method comprising: identifying a set of candidateinterconnects for the layer promotion; scoring and sorting, using aprocessor, the set of candidate interconnects according to a respectivescore, thereby establishing a respective rank; assessing routing demandand resource availability based on promoting the set of candidateinterconnects; and managing, using the processor, the set of candidateinterconnects based on the respective rank and the assessing, theassessing and the managing being done iteratively and the managingincluding, in at least one iteration, generating a second set ofcandidate interconnects based on reducing the set of candidateinterconnects, wherein the scoring the set of candidate interconnectsincludes determining, for each candidate interconnect of the set ofcandidate interconnects, an amount of time by which the candidateinterconnect exceeds a timing requirement and a degree to which a lengthof a path including the candidate interconnect exceeds a minimumpossible length of the path, and the scoring the set of candidateinterconnects includes calculating, for the respective candidateinterconnect, a score given by:score=scaling_(t) *t_metric+scaling_(p) *p_metric, where scaling_(t) andscaling_(p) are scaling factors, t_metric relates to the amount of timeby which the candidate interconnect exceeds the timing requirement, andp_metric relates to the degree to which the length of the path includingthe candidate interconnect exceeds the minimum possible length of thepath.
 8. The method according to claim 7, wherein the assessing includesdetermining congestion in a higher layer based on hypothetical promotionof the set of candidate interconnects to the higher layer, the higherlayer being further from devices than a current layer of the set ofcandidate interconnects.
 9. The method according to claim 8, wherein theassessing further includes determining a number of the set of candidateinterconnects that may form the second set of candidate interconnectsbased on the congestion.
 10. The method according to claim 7, whereinthe scoring and sorting the set of candidate interconnects, theassessing, and the managing is done on a per-grid basis.
 11. The methodaccording to claim 7, wherein t_metric is given by:$\frac{failure\_ amount}{{highest\_ failure}{\_ amount}},$ wherefailure_amount is the amount of time by which the candidate interconnectexceeds the timing requirement, and highest_failure_amount is a highestamount of time by which any candidate interconnect of the set ofcandidate interconnects in a same grid as the candidate interconnectexceeds a respective timing requirement, and the p_metric is given by:$\frac{placement\_ ratio}{{maximum\_ placement}{\_ ratio}},$ whereplacement_ratio indicates the degree to which the length of the pathincluding the candidate interconnect exceeds the minimum possible lengthof the path, and maximum_placement_ratio indicates a largestplacement_ratio determined for any candidate interconnect of the set ofcandidate interconnects in a same grid as the candidate interconnect.